Bucket sort and RADIX sort are two well-known integer sorting algorithms.This paper measures empirically what is the time usage and memory consumptionfor different kinds of input sequences. The algorithms are compared both from atheoretical standpoint but also on how well they do in six different use casesusing randomized sequences of numbers. The measurements provide data on howgood they are in different real-life situations. It was found that bucket sort was faster than RADIX sort, but that bucketsort uses more memory in most cases. The sorting algorithms performed fasterwith smaller integers. The RADIX sort was not quicker with already sortedinputs, but the bucket sort was.
展开▼
